MODELS FOR CONCURRENCY ( Draft copy of September 21 , 1993 ) Glynn

نویسندگان

  • Glynn Winskel
  • Mogens Nielsen
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relationships Between Models of Concurrency

Models for concurrency can be classified with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics. The classifications are formalized through the medium of category theory.

متن کامل

A Classiication of Models for Concurrency

Extended Abstract Models for concurrency can be classiied with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, lin-ear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics. The classiications are formalised through the medium of category theory.

متن کامل

A Classification of Models for Concurrency

The difference between the models may be expressed in terms of the parameters according to which models are often classified. For instance, a distinction made explicitly in the theory of Petri nets, but sensible in a wider context, is that between so-called “system” models allowing an explicit representation of the (possibly repeating) states in a system, and “behaviour” models abstracting away...

متن کامل

Deterministic Behavioural Models for Concurrency

Extended Abstract This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in the rather strong sense of being equivalent as categories. The models are: deterministic labelled event structures, generalized trace languages in which the independence relation ...

متن کامل

Models for Concurrency (A revised version of DAIMI PB-429)

This is, we believe, the final version of a chaper for the Handbook of Logic and the Foundations of Computer Science, vol.IV, Oxford University Press. It surveys a range of models for parallel computertation to include interleaving models like transition systems, synchronisation trees and languages (often called Hoare traces in this context), and models like Petri nets, asynchronous transition ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993